منابع مشابه
CS 167 : Reading in Algorithms
These notes give suggestions about questions to keep in mind when reading a paper, giving a presentation on a paper, or writing up your own research. These questions are meant largely as guidelines — not all of them will apply to every research paper, and different students will have different favored approaches for understanding a research paper. Here are the five most important questions. Exa...
متن کاملCS 167 : Reading in Algorithms Counting Triangles ∗
In these notes we discuss the earlier sections of a paper of Suri and Vassilvitskii, with the great title “Counting Triangles and the Curse of the Last Reducer” [2]. It is a good example of an applied paper with interesting algorithmic content. Consider an unweighted, undirected graph G = (V,E). G could be anything, but the authors are motivated by graphs derived from social networks. For examp...
متن کاملNutrition Classics
(1) On the macroscopical alterations in the tissues of guinea-pigs which had been fed exclusively on bread, groats, and unpeeled grain. BY experimenting with the " one-sided " diets which were used in the experiments, mentioned in the foregoing paper on polyneuritis in poultry, we found that guinea-pigs also contract a disease, and that this disease is accompanied by very characteristic changes...
متن کاملNeuroradiology classics.
In our clinical practice and teachings of neuroradiology, we usually focus on the ‘‘here and now’’, not the historical underpinnings. As Albert Lyons states in the introduction to his book on the history of medicine, ‘‘the student, practitioner, and public marvel at the contemporary medical scene, with its enlarged scientific understanding, remarkable diagnostic tools, effective therapeutic met...
متن کاملCS 167 : Reading in Algorithms Triangle - Dense Graphs ∗
In these notes we discuss a paper of Gupta, Roughgarden, and Seshadhri, “Decompositions of Triangle-Dense Graphs” [1]. The motivation of the paper is to develop a theory of algorithms for social networks, like the graphs derived from Facebook or Twitter data mentioned in the first lecture. That is, the goal is to develop graph algorithms that work well on social networks, if not on worst-case g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 2012
ISSN: 0001-0782,1557-7317
DOI: 10.1145/2133806.2133818